Some Cobweb Posets Digraphs’ Elementary Properties and Questions
نویسنده
چکیده
A digraph that represents reasonably a scheduling problem should have no cycles i.e. it should be DAG i.e. a directed acyclic graph. Here down we shall deal with special kind of graded DAGs named KoDAGs. For their definition and first primary properties see [1], where natural join of di-bigraphs (directed bi-parted graphs) and their corresponding adjacency matrices is defined and then applied to investigate cobweb posets and their Hasse digraphs called KoDAGs. In this report we extend the notion of cobweb poset while delivering some elementary consequences of the description and observations established in [1].
منابع مشابه
On natural join of posets properties and first applications.
In early beginnings of the past century Felix Hausdorff introduced the concept of a partially ordered set thus extending Richard Dedekind lattice theory which began in the early 1890s. Then the subject lay more or less dormant until Garrett Birkhoff, Oystein Ore and others picked it up in the 1930s. Since then, many noted mathematicians have contributed to the subject, including Garrett Birkhof...
متن کاملOn incidence algebras description of cobweb posets
Abstract The explicite formulas for Möbius function and some other important elements of the incidence algebra of an arbitrary cobweb poset are delivered. For that to do one uses Kwaśniewski’s construction of his cobweb posets [8, 9]. The digraph representation of these cobweb posets constitutes a newly discovered class of orderable DAG’s [12, 6, 1] named here down KoDAGs with a kind of univers...
متن کاملCobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their diBigraphs and the Corresponding Adjacency
sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering ch...
متن کاملCobweb Posets and KoDAG Digraphs are Representing Natural Join of Relations, their di-Bigraphs
sponding adjacency matrices is defined and then applied to investigate the so called cobweb posets and their Hasse digraphs called KoDAGs. KoDAGs are special orderable Directed Acyclic Graphs which are cover relation digraphs of cobweb posets introduced by the author few years ago. KoDAGs appear to be distinguished family of Ferrers digraphs which are natural join of a corresponding ordering ch...
متن کاملCobweb posets - Recent Results
SUMMARY Cobweb posets uniquely represented by directed acyclic graphs are such a generalization of the Fibonacci tree that allows joint combinatorial interpretation for all of them under admissibility condition. This interpretation was derived in the source papers ([6,7] and references therein to the first author).[7,6,8] include natural enquires to be reported on here. The purpose of this pres...
متن کامل